On some problems related to palindrome closure
نویسندگان
چکیده
منابع مشابه
On some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if θ is an involutory antimorphism of A, then both θ-palindromic closures of any factor of a θ-standard word are also factors of some θ-standard word. We also introduce the class of ...
متن کاملSome problems related to bisimilarity on BPP
Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Bisimilarity is studied on various subclasses of BPP as well. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. So far this problem was only known to be PSPACE-hard.
متن کاملSome Decision Problems Related To
The problem of deciding whether a monoid that is given through a nite presentation is a regular monoid as well as two closely related decision problems are considered. Since these problems are undecidable in general, they are investigated for certain restricted classes of nite presentations. Some new decidability results as well as some new undecidability results are obtained, which show that f...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
On Some Communication Complexity Problems Related to THreshold Functions
We study the computation of threshold functions using formulas over the basis fAND, OR, NOTg, with the aim of unifying the lower bounds of Hansel, Krichevskii, and Khrapchenko. For this we consider communication complexity problems related to threshold function computation. We obtain an upper bound for a communication problem used by Karchmer and Wigderson to derive the depth version of the Khr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2008
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2007064